import java.util.*;

public class Test {
    /*
    题目1：前缀和
     */
        public static void main1(String[] args) {
            Scanner in = new Scanner(System.in);
            int n = in.nextInt();
            int q = in.nextInt();

            int[] arr = new int[n + 1];
            for (int i = 1; i < n + 1; i++) {
                arr[i] = in.nextInt();
            }

            int[][] qArr = new int[q][2];

            for (int i = 0; i < q; i++) {
                qArr[i][0] = in.nextInt();
                qArr[i][1] = in.nextInt();
            }

            long[] dp = new long[n + 1];
            for (int i = 1; i < n + 1; i++) {
                dp[i] = dp[i - 1] + arr[i];
            }

            for (int i = 0; i < q; i++) {
                long ret = dp[qArr[i][1]] - dp[qArr[i][0] - 1];
                System.out.println(ret);
            }
        }


        public static void main(String[] args) {
            Scanner in = new Scanner(System.in);
            int n = in.nextInt();
            int q = in.nextInt();

            int[] arr = new int[n + 1];
            for (int i = 1; i < n + 1; i++) {
                arr[i] = in.nextInt();
            }

            long[] dp = new long[n + 1];
            for (int i = 1; i < n + 1; i++) {
                dp[i] = dp[i - 1] + arr[i];
            }

            while (q > 0) {
                int l = in.nextInt(), r = in.nextInt();
                System.out.println(dp[r] - dp[l - 1]);
                q--;
            }
        }

        /*
        题目2：二维前缀和
         */
        public static void main2(String[] args) {
            Scanner in = new Scanner(System.in);
            int n = in.nextInt(), m = in.nextInt(), q = in.nextInt();

            int[][] arr = new int[n + 1][m + 1];
            for(int i = 1; i < n + 1; i++){
                for(int j = 1; j < m + 1; j++){
                    arr[i][j] = in.nextInt();
                }
            }

            long[][] dp = new long[n + 1][m + 1];
            for(int i = 1; i < n + 1; i++){
                for(int j = 1; j < m + 1; j++){
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + arr[i][j];
                }
            }

            while(q > 0){
                int x1 = in.nextInt(), y1 = in.nextInt(), x2 = in.nextInt(), y2 = in.nextInt();
                long ret = dp[x2][y2] - dp[x2][y1 - 1] - dp[x1 - 1][y2] + dp[x1 - 1][y1 - 1];
                System.out.println(ret);
                q--;
            }
        }


}
